Using maximality and minimality conditions to construct inequality chains
نویسندگان
چکیده
منابع مشابه
Using maximality and minimality conditions to construct inequality chains
The following inequality chain has been extensively studied in the discrete mathematical literature: i r ~ y ~ i ~ f l ~ F ~IR, where ir and IR denote the lower and upper irredundance numbers of a graph, 2: and F denote the lower and upper domination numbers of a graph, i denotes the independent domination number and fl denotes the vertex independence number of a graph. More than one hundred pa...
متن کاملThe Parameterized Complexity of Maximality and Minimality Problems
Many parameterized problems (as the clique problem or the dominating set problem) ask, given an instance and a natural number k as parameter, whether there is a solution of size k. We analyze the relationship between the complexity of such a problem and the corresponding maximality (minimality) problem asking for a solution of size k maximal (minimal) with respect to set inclusion. As our resul...
متن کاملInformativity-based Maximality Conditions*
Von Fintel, Fox and Iatridou 2005/2012 argue that 'the NP' should not be taken to refer to the largest NP-object, as is commonly thought, but rather to the object x such that the proposition 'x satisfies NP' is maximally informative. In particular, they show that in some cases an informativity-based treatment correctly predicts that 'the NP' should refer to the smallest rather than to the large...
متن کاملNecessary Conditions for Schur-maximality
McNamara and Pylyavskyy conjectured precisely which connected skew shapes are maximal in the Schur-positivity order, which says that B ≤s A if sA − sB is Schurpositive. Towards this, McNamara and van Willigenburg proved that it suffices to study equitable ribbons, namely ribbons whose row lengths are all of length a or (a+ 1) for a ≥ 2. In this paper we confirm the conjecture of McNamara and Py...
متن کاملMinimality Conditions on Πk-Connectedness in Graphs
Let k be a positive integer. A graph G = (V,E) is said to be Πk connected if for any given edge subset F of E(G) with |F | = k, the subgraph induced by F is connected. In this paper, we explore the minimality conditions on Πkconnectedness of a graph and also its properties of prism and corona graphs are obtained.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1997
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00356-1